A Denotational Semantics for Logic Programming
نویسندگان
چکیده
منابع مشابه
A denotational semantics for equilibrium logic
In this paper we provide an alternative semantics for Equilibrium Logic and its monotonic basis, the logic of Here-and-There (also known as Gödel’s G3 logic) that relies on the idea of denotation of a formula, that is, a function that collects the set of models of that formula. Using the threevalued logic G3 as a starting point and an ordering relation (for which equilibrium/stable models are m...
متن کاملA Denotational Semantics for First-Order Logic
In Apt and Bezem [AB99) we provided a computational interpretation of first-order formulas over arbitrary interpretations. Here we complement this work by introducing a denotational semantics for first-order logic. Additionally, by allowing an assignment of a non-ground term to a variable we introduce in this framework logical variables. The semantics combines a number of well-known ideas from ...
متن کاملDenotational Semantics for Propositional Light Affine Logic
Denotational semantics often make invariants explicit which are implicit in the structure of a proof theoretic system. Asperti’s Light Affine Logic is a proof theoretic system, which can be viewed as a computation model. It was shown by Asperti and Roversi that, as a computation model, it captures the feasible functions. Light Affine Logic is a simplification of Girard’s Light Linear Logic, to ...
متن کاملDenotational Semantics for Teaching Lazy Functional Programming
If you believe this document infringes copyright then please contact the KAR admin team with the take-down information provided at http://kar.kent.ac.uk/contact.html Citation for published version Chitil, Olaf (1999) Denotational Semantics for Teaching Lazy Functional Programming. In: Proceedings of the Workshop on Functional and Declarative Programming in Education, 29 September 1999, Paris, F...
متن کاملDenotational Versus Declarative Semantics for Functional Programming
Denotational semantics is the usual mathematical semantics for functional programming languages. It is higher order (H.O.) in the sense that the semantic domain D includes D ! D] as a subdomain. On the other hand, the usual declarative semantics for logic programs is rst order (F.O.) and given by the least Herbrand model. In this paper, we take a restricted kind of H.O. conditional rewriting sy...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: DAIMI Report Series
سال: 1985
ISSN: 2245-9316,0105-8517
DOI: 10.7146/dpb.v14i201.7552